λ - calculus and Quantitative Program Analysis ( Extended
نویسندگان
چکیده
In this paper we show how the framework of probabilistic abstract interpretation can be applied to statically analyse a probabilistic λ-calculus. We start by reviewing the classical framework of abstract interpretation. We choose to use (first-order) strictness analysis as our running example. We present the definition of probabilistic abstract interpretation and use it to construct a probabilistic strictness analysis.
منابع مشابه
Probabilistic λ-calculus and Quantitative Program Analysis
We show how the framework of probabilistic abstract interpretation can be applied to statically analyse a probabilistic version of the λ-calculus. The resulting analysis allows for a more speculative use of its outcomes based on the consideration of statistically defined quantities. After introducing a linear operator based semantics for our probabilistic λ-calculus ΛP , and reviewing the frame...
متن کاملAlmost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
It is well known that the length of a β-reduction sequence of a simply typed λ-term of order k can be huge; it is as large as k-fold exponential in the size of the λ-term in the worst case. We consider the following relevant question about quantitative properties, instead of the worst case: how many simply typed λ-terms have very long reduction sequences? We provide a partial answer to this que...
متن کاملProgramming Languages and Lambda Calculi
These are the basic thoughts that should go into the preface. It is not a final version. In a series of papers in the mid-1960's, Landin expounded two important observations about programming languages. First, he argued that all programming languages share a basic set of facilities for specifying computation but differ in their choice of data and data primitives. The set of common facilities co...
متن کاملConfluence of the coinductive [lambda]-calculus
The coinductive λ-calculus Λ arises by a coinductive interpretation of the grammar of the standard λ-calculus Λ and contains non-wellfounded λ-terms. An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait/MartinLöf style development argument. This yields bounds for the lengths of those joining reduction sequences that are guar...
متن کاملNormalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
It has been known since Ehrhard and Regnier’s seminal work on the Taylor expansion of λ-terms that this operation commutes with normalization: the expansion of a λ-term is always normalizable and its normal form is the expansion of the Böhm tree of the term. We generalize this result to the non-uniform setting of the algebraic λ-calculus, i.e., λ-calculus extended with linear combinations of te...
متن کامل